Two-Guard Art Gallery Problem
نویسندگان
چکیده
منابع مشابه
The Parameterized Hardness of the Art Gallery Problem
Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x and y is contained in P. The Point Guard Art Gallery problem asks for a minimum set S such that every point in P is visible from a point in S. The Vertex Guard Art Gallery problem asks for such a set S subset of the vertices of P. A point in the set S is referred to as...
متن کاملAn Approximation Algorithm for the Art Gallery Problem
Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x and y is contained in P. The point-guard art gallery problem asks for a minimum set S such that every point in P is visible from a point in S. Assuming integer coordinates and a special general position assumption, we present the first O(log OPT)-approximation algorith...
متن کاملColoring Variations of the Art Gallery Problem
The art gallery problem [2] asks for the smallest possible size of a point set S (the guards) to completely guard the interior of a simple polygon P (the art gallery). This thesis treats variations of the original problem that arise when we introduce a coloring of the guards. Rather than asking for the minimum number of guards we ask for the minimum number of colors. In [4] L. H. Erickson and S...
متن کاملA Pseudo - Polynomial Time O ( log 2 n ) - Approximation Algorithm for Art Gallery Problems
Master of Science in Mechanical Engineering and Master of Science in Electrical Engineering and Computer Science In this thesis, we give a pseudo-polynomial time o (log2 n)-approximation algorithm for a variant of the art gallery problem the point-guard problem. The point-guard problem involves finding the minimum number of points and their positions so that guards located at these points cover...
متن کاملComplexity of the General Chromatic Art Gallery Problem
For a polygonal region P with n vertices, a guard cover G is a set of points in P , such that any point in P can be seen from a point in G. In a colored guard cover, every element in a guard cover is assigned a color, such that no two guards with the same color have overlapping visibility regions. The Chromatic Art Gallery Problem (CAGP) asks for the minimum number of colors for which a colored...
متن کامل